Graphs with prescribed star complement for 1 as the second largest eigenvalue
نویسندگان
چکیده
Let G be a graph of order n and let μ be an eigenvalue of multiplicity m. A star complement for μ in G is an induced subgraph of G of order n −m with no eigenvalue μ. In this paper, we study maximal and regular graphs which have Kr,s + tK1 as a star complement for 1 as the second largest eigenvalue. It turns out that some well known strongly regular graphs are uniquely determined by such a star complement. AMS Subject Classification: 05C50.
منابع مشابه
Graphs with prescribed star complement for the eigenvalue 1
Let G be a graph of order n and let μ be an eigenvalue of multiplicity m. A star complement for μ in G is an induced subgraph of G of order n−m with no eigenvalue μ. In this paper, we study the maximal graphs as well as regular graphs which have Kr,s + tK1 as a star complement for eigenvalue 1. It turns out that some well known strongly regular graphs are uniquely determined by such a star comp...
متن کاملA Database of Star Complements of Graphs
We take G to be an undirected graph without loops or multiple edges, with vertex set V (G) = f1; : : : ; ng, and with (0; 1)-adjacency matrix A. Let P denote the orthogonal projection of IR onto the eigenspace E( ) of A, and let fe1; : : : ; eng be the standard orthonormal basis of IR. Since E( ) is spanned by the vectors Pej (j = 1; : : : ; n) there exists X V (G) such that the vectors Pej (j ...
متن کاملStar complements and exceptional graphs
Let G be a finite graph of order n with an eigenvalue μ of multiplicity k. (Thus the μ-eigenspace of a (0, 1)-adjacency matrix of G has dimension k.) A star complement for μ in G is an induced subgraph G−X of G such that |X| = k and G−X does not have μ as an eigenvalue. An exceptional graph is a connected graph, other than a generalized line graph, whose eigenvalues lie in [−2,∞). We establish ...
متن کاملOn Independent Star Sets in Finite Graphs
Let G be a finite graph with μ as an eigenvalue of multiplicity k. A star set for μ is a set X of k vertices in G such that μ is not an eigenvalue of G−X. We investigate independent star sets of largest possible size in a variety of situations. We note connections with symmetric designs, codes, strongly regular graphs, and graphs with least eigenvalue −2. AMS Classification: 05C50
متن کاملCo-cliques and star complements in extremal strongly regular graphs
Suppose that the positive integerμ is the eigenvalue of largest multiplicity in an extremal strongly regular graph G. By interlacing, the independence number of G is at most 4μ2 + 4μ− 2. Star complements are used to show that if this bound is attained then either (a) μ = 1 and G is the Schläfli graph or (b) μ = 2 and G is the McLaughlin graph. © 2006 Elsevier Inc. All rights reserved. AMS class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 116 شماره
صفحات -
تاریخ انتشار 2014